Decidable Description Logics of Context with Rigid Roles
نویسندگان
چکیده
To represent and reason about contextualized knowledge often two-dimensional Description Logics (DLs) are employed, where one DL is used to describe contexts (or possible worlds) and the other DL is used to describe the objects, i.e. the relational structure of the specific contexts. Previous approaches for DLs of context that combined pairs of DLs resulted in undecidability in those cases where so-called rigid roles are admitted, i.e. if parts of the relational structure are the same in all contexts. In this paper, we present a novel combination of pairs of DLs and show that reasoning stays decidable even in the presence of rigid roles. We give complexity results for various combinations of DLs including ALC, SHOQ, and EL.
منابع مشابه
Description Logics of Context with Rigid Roles Revisited
To represent and reason about contextualized knowledge often two-dimensional Description Logics (DLs) are employed, where one DL is used to describe contexts (or possible worlds) and the other DL is used to describe the objects, i.e. the relational structure of the specific contexts. Previous approaches for DLs of context that combined pairs of DLs resulted in undecidability in those cases wher...
متن کاملDecidable Contextualized DLs with Rigid Roles
Description logics (DLs) of context can be employed to represent and reason about contextualized knowledge, which naturally occurs in practice [5,4,7,9,8]. Consider, for instance, the rôles played by a person in different contexts. The person Bob, who works for the company Siemens, plays the rôle of an employee of Siemens in the work context, whereas he might play the rôle of a customer of Siem...
متن کاملLightweight Temporal Description Logics with Rigid Roles and Restricted TBoxes
We study temporal description logics (TDLs) based on the branching-time temporal logic CTL and the lightweight DL EL in the presence of rigid roles and restricted TBoxes. While TDLs designed in this way are known to be inherently nonelementary or even undecidable over general TBoxes, there is hope for a better computational behaviour over acyclic or empty TBoxes. We begin by showing that the ba...
متن کاملOn the Undecidability of Description and Dynamic Logics with Recursion and Counting
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar chy of decidable logics with multiple maximal el ements. It would be desirable to combine different maximal logics into one super-logic, but then in ference may turn out to be undecidable. Then it is important to characterize the decidability thresh old for these logics. In this perspective, an inte...
متن کامل